An intelligent water drop algorithm for optimizing task scheduling in grid environment
نویسندگان
چکیده
The goal of grid computing is to provide powerful computing for complex scientific problems by utilizing and sharing large scale resources available in the grid. Efficient scheduling algorithms are needed to allocate suitable resources for each submitted task. So scheduling is one of the most important issues for achieving high performance computing in grid. This paper addresses an approach for optimizing scheduling using a nature inspired Intelligent Water Drops (IWD) algorithm. In the proposed approach IWD algorithm is adopted to improve the performance of task scheduling in grid environment. The performance of Ant Colony Optimization (ACO) algorithm for task scheduling is compared with the proposed IWD approach and it is proved that task scheduling using IWD can efficiently and effectively allocate tasks to suitable resources in the grid.
منابع مشابه
Application of Intelligent Water Drops in Transient Analysis of Single Conductor Overhead Lines Terminated to Grid-Grounded Arrester under Direct Lightning Strikes
In this paper, Intelligent water drop algorithm (IWD) is used to analyze single overhead line connected to grid-grounded arrester. In this approach, at first Norton’s equivalent circuit of the overhead line over lossy soil is computed by method of moments (MoM) and then for the problem under consideration, a nonlinear equivalent circuit in the frequency domain is proposed. Finally applying inte...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملDynamic Replication based on Firefly Algorithm in Data Grid
In data grid, using reservation is accepted to provide scheduling and service quality. Users need to have an access to the stored data in geographical environment, which can be solved by using replication, and an action taken to reach certainty. As a result, users are directed toward the nearest version to access information. The most important point is to know in which sites and distributed sy...
متن کاملWorkflow Scheduling Algorithms in Grid Computing
Grid computing is a process of aggregate the functionality of different geographically resources and provide services to the user. Scheduling is most popular research area in grid computing for achieving high performance. In scheduling, tasks are assigning to resources and maintain the execution. Dependencies constraints are need to preserve for workflow scheduling in grid computing. In this pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. Arab J. Inf. Technol.
دوره 13 شماره
صفحات -
تاریخ انتشار 2016